RWTH Aachen University

Results: 580



#Item
111

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

Add to Reading List

Source URL: verify.rwth-aachen.de

Language: English - Date: 2015-04-16 09:50:09
    112

    Deciding Innermost Loops? Ren´e Thiemann1 , J¨ urgen Giesl2 , and Peter Schneider-Kamp2 1 Institute of Computer Science, University of Innsbruck, Austria

    Add to Reading List

    Source URL: verify.rwth-aachen.de

    Language: English - Date: 2015-04-16 09:50:14
      113

      Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode M. Brockschmidt, T. Str¨ oder, C. Otto, J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany

      Add to Reading List

      Source URL: verify.rwth-aachen.de

      Language: English - Date: 2015-04-16 09:49:59
        114

        COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation Mohammad El-Hajj Department of Computing Science University of Alberta Edmonton, AB, Canada

        Add to Reading List

        Source URL: sunsite.informatik.rwth-aachen.de

        Language: English - Date: 2003-11-14 14:08:06
          115

          Evaluating the Portability of UPC to the Cell Broadband Engine Ruben Niederhagen, Stefan Lankes Chair for Operating Systems, RWTH Aachen University, Templergraben 55, 52056 Aachen, Germany {ruben,lankes}@lfbs.rwth-aachen

          Add to Reading List

          Source URL: polycephaly.org

          Language: English - Date: 2008-08-04 05:22:14
            116

            Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting M. Brockschmidt, C. Otto, J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany RTA 2011, Novi Sad

            Add to Reading List

            Source URL: verify.rwth-aachen.de

            Language: English - Date: 2015-04-16 09:49:59
              117

              Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting∗ Marc Brockschmidt, Carsten Otto, Jürgen Giesl LuFG Informatik 2, RWTH Aachen University, Germany Abstract

              Add to Reading List

              Source URL: verify.rwth-aachen.de

              Language: English - Date: 2015-04-16 09:49:59
                118

                Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode M. Brockschmidt, T. Str¨ oder, C. Otto, J. Giesl LuFG Informatik 2, RWTH Aachen University, Germany

                Add to Reading List

                Source URL: verify.rwth-aachen.de

                Language: English - Date: 2015-04-16 09:49:59
                  119

                  MAFIA: A Performance Study of Mining Maximal Frequent Itemsets Doug Burdick £ University of Wisconsin-Madison Manuel Calimlim

                  Add to Reading List

                  Source URL: sunsite.informatik.rwth-aachen.de

                  Language: English - Date: 2003-11-22 10:12:34
                    120

                    Proving Termination of Heap-Manipulating Java Programs Marc Brockschmidt MSR Cambridge LuFG Informatik 2, RWTH Aachen University, Germany

                    Add to Reading List

                    Source URL: verify.rwth-aachen.de

                    Language: English - Date: 2015-04-16 09:49:59
                      UPDATE